Parallel Graph Transformation Applied to AGG Tool
نویسندگان
چکیده
Graph transformation is one of the key concepts in graph grammar. In order to accelerate the graph transformation, the concept of parallel graph transformation has been proposed by different tools such as AGG tool. The theory of parallel graph transformation used by AGG just allows clarifying the concepts of conflict and dependency between the transformation rules. This work proposes an approach of parallel graph transformations which enables dependent transformation rules to be executed in parallel. Keywords-component; Graph transformation; Critical pair; Synchronization; AGG.
منابع مشابه
AGG: A Tool Environment for Algebraic Graph Transformation
AGG is a general tool environment for algebraic graph transformation which follows the interpretative approach. Its special power comes from a very exible attribution concept. AGG graphs are allowed to be attributed by any kind of Java objects. Graph transformations can be equipped with arbitrary computations on these Java objects described by a Java expression. The AGG environment consists of ...
متن کاملImplementing Petri Net Transformations using Graph Transformation Tools
Petri net transformations have been defined formally in the abstract framework of adhesive HLR categories, which allows rule-based rewriting of graphlike structures, similar to graph transformation. In this paper we discuss differences between Petri net rewriting and graph rewriting which makes it necessary to add checks and conditions when implementing Petri net transformations using an existi...
متن کاملAnalysis of Hypergraph Transformation Systems in AGG based on M-Functors
Hypergraph transformation systems are examples of M -adhesive transformation systems based on M -adhesive categories. For typed attributed graph transformation systems, the tool environment AGG allows the modelling, the simulation and the analysis of graph transformations. A corresponding tool for analysis of hypergraph transformation systems does not exist up to now. The purpose of this paper ...
متن کاملDetecting Structural Refactoring Conflicts Using Critical Pair Analysis
Refactorings are program transformations that improve the software structure while preserving the external behaviour. In spite of this very useful property, refactorings can still give rise to structural conflicts when parallel evolutions to the same software are made by different developers. This paper explores this problem of structural evolution conflicts in a formal way by using graph trans...
متن کاملFormal Relationship between Petri Net and Graph Transformation Systems based on Functors between M-adhesive Categories
Various kinds of graph transformations and Petri net transformation systems are examples of M -adhesive transformation systems based on M -adhesive categories, generalizing weak adhesive HLR categories. For typed attributed graph transformation systems, the tool environment AGG allows the modeling, the simulation and the analysis of graph transformations. A corresponding tool for Petri net tran...
متن کامل